Random Trees in Random Graphs

نویسندگان

  • E. A. BENDER
  • N. C. WORMALD
  • Andrew Odlyzko
چکیده

We show that a random labeled n-vertex graph almost surely contains isomorphic copies of almost all labeled n-vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n increases, and the set of trees referred to as "almost all" depends on the random graph. In the other sense, the probability of an edge occurring is fixed, and the relevant set of trees is predetermined. The same method applies to show that almost all labeled ra-tournaments contain isomorphic copies of almost all labeled oriented n-trees.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks on Directed Covers of Graphs

Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still equals the branching number, upper and lower growth rates do not longer coincide in general. Furthermore, the behaviour of random walks on directed covers of infi...

متن کامل

Spanning Trees of Small Degree

In this paper we show that pseudo-random graphs contain spanning trees of maximum degree 3. More specifically, (n, d, λ)-graphs with sufficiently large spectral gap contain such spanning trees.

متن کامل

Branches in random recursive k-ary trees

In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.

متن کامل

Ising models on locally tree-like graphs

We consider Ising models on graphs that converge locally to trees. Examples include random regular graphs with bounded degree and uniformly random graphs with bounded average degree. We prove that the ‘cavity’ prediction for the limiting free energy per spin is correct for any temperature and external field. Further, local marginals can be approximated by iterating a set of mean field (cavity) ...

متن کامل

Resistance Dimensions of Branching Processes in Varying Environments Trees

In this paper we pursue our study, in [5] and [6], on dimensions of some random trees. These dimensions are, for polynomially growing graphs, closely related to the type (transience-recurrence) problem of the simple random walk on such graphs. We give an interval estimation for the mean resistance dimension of branching processes in varying environments trees.

متن کامل

Random Walks on Infinite Graphs and Groups — a Survey on Selected Topics

Contents 1. Introduction 2 2. Basic definitions and preliminaries 3 A. Adaptedness to the graph structure 4 B. Reversible Markov chains 4 C. Random walks on groups 5 D. Group-invariant random walks on graphs 6 E. Harmonic and superharmonic functions 6 3. Spectral radius, amenability and law of large numbers 6 A. Spectral radius, isoperimetric inequalities and growth 6 B. Law of large numbers 9 ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010